package binPack.maxRect
{
	/**
	 * Specifies the different heuristic rules that can be used when deciding where to place a new rectangle.
	 * */
	public class FreeRectChoiceHeuristic
	{
		/**BSSF: Positions the rectangle against the short side of a free rectangle into which it fits the best.*/
		public static const RectBestShortSideFit:int = 0;
		/** BLSF: Positions the rectangle against the long side of a free rectangle into which it fits the best.  */
		public static const RectBestLongSideFit:int = 1;
		/**  BAF: Positions the rectangle into the smallest free rect into which it fits. */
		public static const RectBestAreaFit:int = 2;
		/** BL: Does the Tetris placement.  */
		public static const RectBottomLeftRule:int = 3;
		/** CP: Choosest the placement where the rectangle touches other rects as much as possible. */
		public static const RectContactPointRule:int = 4;
		
	}
}